package dp;

import java.util.Arrays;

/**
 * @ Author     ：侯耀祖
 * @ Description：
 */
public class canPartition {
    public boolean canPartition(int[] nums) {
        if (nums == null || nums.length == 0){
            return false;
        }
        int sum = Arrays.stream(nums).sum();
        if (sum % 2 != 0){
            return false;
        }
        int target = sum/2;
        int[] dp = new int[target + 1];
        dp[0] = 0;
        for (int i = 0; i < nums.length; i++) {
            for (int j = target; j >= nums[i]; j--) {
                dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
            }
            if (dp[target] == target){
                return true;
            }
        }
        return dp[target] == target;
    }
}
